A Note on the Undercut Procedure ( Extended Abstract ) Haris Aziz
نویسنده
چکیده
The undercut procedure was presented by Brams, Kilgour and Klamler (2012) as a procedure for identifying an envyfree allocation when agents have preferences over sets of objects. They assumed that agents have strict preferences over objects and their preferences are extended over to sets of objects via the responsive set extension. We point out some shortcomings of the undercut procedure. We then simplify the undercut procedure of Brams et al. and show that it works under a more general condition where agents may express indifference between objects and they may not necessarily have responsive preferences over sets of objects. Finally, we show that the procedure works even if agents have unequal claims.
منابع مشابه
A note on the undercut procedure
The undercut procedure was presented by Brams et al. [3] as a procedure for identifying an envy-free allocation when agents have preferences over sets of objects. They assumed that agents have strict preferences over objects and their preferences are extended over to sets of objects via the responsive set extension. We point out some shortcomings of the undercut procedure. We then simplify the ...
متن کاملCharacterizing SW-Efficiency in the Social Choice Domain
Recently, Dogan, Dogan and Yildiz (2015) presented a new efficiency notion for the random assignment setting called SW (social welfare)-efficiency and characterized it. In this note, we generalize the characterization for the more general domain of randomized social choice.
متن کاملTesting substitutability of weak preferences
In many-to-many matching models, substitutable preferences constitute the largest domain for which a pairwise stable matching is guaranteed to exist. In this note, we extend the recently proposed algorithm of Hatfield et al. [3] to test substitutability of weak preferences. Interestingly, the algorithm is faster than the algorithm of Hatfield et al. by a linear factor on the domain of strict pr...
متن کاملAlgorithms for two variants of Satisfaction Approval Voting
Multi-winner voting rules based on approval ballots have received increased attention in recent years. In particular Satisfaction Approval Voting (SAV) and its variants have been proposed. In this note, we show that the winning set can be determined in polynomial time for two prominent and natural variants of SAV. We thank Arkadii Slinko for suggesting these problems in a talk at the Workshop o...
متن کاملA Numerical Analysis on the Performance of Counterweight Balance on the Stability of Undercut Slopes
One of the important parameters in undercut slopes design is the determination of the maximum stable undercut span. The maximum stable undercut span is a function of slope geometry, the strength parameters of the slope material, condition of discontinuities, underground water condition, etc. However, the desired production capacity and therefore the size of excavating equipment will sometimes a...
متن کامل